Aggressive Tetrahedral Mesh Improvement

نویسندگان

  • Bryan Matthew Klingner
  • Jonathan Richard Shewchuk
چکیده

We present a tetrahedral mesh improvement schedule that usually creates meshes whose worst tetrahedra have a level of quality substantially better than those produced by any previous method for tetrahedral mesh generation or “mesh clean-up.” Our goal is to aggressively optimize the worst tetrahedra, with speed a secondary consideration. Mesh optimization methods often get stuck in bad local optima (poor-quality meshes) because their repertoire of mesh transformations is weak. We employ a broader palette of operations than any previous mesh improvement software. Alongside the best traditional topological and smoothing operations, we introduce a topological transformation that inserts a new vertex (sometimes deleting others at the same time). We describe a schedule for applying and composing these operations that rarely gets stuck in a bad optimum. We demonstrate that all three techniques—smoothing, vertex insertion, and traditional transformations—are substantially more effective than any two alone. Our implementation usually improves meshes so that all dihedral angles are between 31◦ and 149◦, or (with a different objective function) between 23◦ and 136◦.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

The concept of optimal Delaunay triangulation (ODT) and the corresponding error-based quality metric are first introduced. Then one kind of mesh smoothing algorithm for tetrahedral mesh based on the concept of ODT is examined. With regard to its problem of possible producing illegal elements, this paper proposes a modified smoothing scheme with a constrained optimization model for tetrahedral m...

متن کامل

Tetrahedral Mesh Improvement Using Multi-face Retriangulation

In this paper we propose a simple technique for tetrahedral mesh improvement without inserting Steiner vertices, concentrating mainly on boundary conforming meshes. The algorithm makes local changes to the mesh to remove tetrahedra which are poor according to some quality criterion. While the algorithm is completely general with regard to quality criterion, we target improvement of the dihedral...

متن کامل

Polyhedral Mesh Generation and Optimization for Non-manifold Domains

We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing the dual of a general tetrahedral mesh. The resulting mesh respects the topology of the domain to the same extent as the input mesh. If the input tetrahedral mesh is Delaunay and well-centered, the resulting mesh is a Voronoi mesh with planar faces. For general tetrahe...

متن کامل

Small Polyhedron Reconnection: A New Way to Eliminate Poorly-Shaped Tetrahedra

Local transformation, or topological reconnection, is one of effective procedures of mesh improvement method, especially for three-dimensional tetrahedral mesh. Although the existing local transformations such as 2-3/3-2 flip are effective in removing poorly-shaped tetrahedra, it is still possible to improve the quality of mesh further by expanding the space of transformation region. The author...

متن کامل

Two Discrete Optimization Algorithms for the Topological Improvement of Tetrahedral Meshes

Edge removal and multi-face removal are two types of local topological transformation that are useful components of a tetrahedral mesh improvement method. This paper offers an algorithm to identify the optimal edge removal transformation that removes a specified edge, and an algorithm to identify the optimal multi-face removal transformation that removes a specified face.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007